Multi-Objective Neighborhood Search Algorithm Based on Decomposition for Multi-Objective Minimum Weighted Vertex Cover Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Stage Fuzzy Load Frequency Control Based on Multi-objective Harmony Search Algorithm in Deregulated Environment

A new Multi-Stage Fuzzy (MSF) controller based on Multi-objective Harmony Search Algorithm (MOHSA) is proposed in this paper to solve the Load Frequency Control (LFC) problem of power systems in deregulated environment. LFC problem are caused by load perturbations, which continuously disturb the normal operation of power system. The objectives of LFC are to mini small size the transient deviati...

متن کامل

Multi-Objective Large Neighborhood Search

The large neighborhood search (LNS) framework introduced by Shaw [11] provides a powerful hybridization of Local Search (LS) and Constraint Programming (CP). The idea of LNS is to combine the expressiveness of CP and the efciency of Local Search (LS) without requiring any meta-heuristic. LNS consists in improving a best-so-far solution by iteratively relaxing it and optimizing this solution usi...

متن کامل

An algorithm for multi-objective job shop scheduling problem

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

متن کامل

Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem

A rigorous runtime analysis of evolutionary multi-objective optimization for the classical vertex cover problem in the context of parameterized complexity analysis has been presented by Kratsch and Neumann [11]. In this paper, we extend the analysis to the weighted vertex cover problem and provide a fixed parameter evolutionary algorithm with respect to OPT , where OPT is the cost of the the op...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sustainability

سال: 2019

ISSN: 2071-1050

DOI: 10.3390/su11133634